V-VARIABLE IMAGE COMPRESSION
نویسندگان
چکیده
منابع مشابه
V-variable image compression
V-variable fractals, where V is a positive integer, are intuitively fractals with at most V different “forms” or “shapes” at all levels of magnification. In this paper we describe how V-variable fractals can be used for the purpose of image compression.
متن کاملMEDICAL IMAGE COMPRESSION: A REVIEW
Within recent years the use of medical images for diagnosis purposes has become necessity. The limitation in transmission and storage space also growing size of medical images has necessitated the need for efficient method, then image Compression is required as an efficient way to reduces irrelevant and redundancy of the image data in order to be able to store or transmits data. It also reduces...
متن کاملGeneralized variable dimensional set partitioning for embedded wavelet image compression
A vector enhancement of Said and Pearlman’s Set Partitioning in Hierarchical Trees (SPIHT) methodology, named VSPIHT, has recently been proposed for embedded wavelet image compression. While the VSPIHT algorithm works better than scalar SPIHT for most images, a common vector dimension to use for coding an entire image may not be optimal. Since statistics vary widely within an image, a greater e...
متن کاملColor Image Compression with a Variable Block-Size Transform Scheme
In a previous paper an adaptive transform-based coding method was introduced and used for the particular application of compressing the monochrome images of videoconference sequences 1]. In the present paper the results of applying this adaptive scheme to compress still color images are presented. The basic principle of the algorithm is to encode those larger 2N 2N-pixel regions featuring low i...
متن کاملVariable resolution Markov modelling of signal data for image compression
Traditionally, Markov models have not been successfully used for compression of signal data other than binary image data. Due to the fact that exact substring matches in non-binary signal data are rare, using full resolution conditioning information generally tends to make Markov models learn slowly, yielding poor compression. However, as is shown in this paper, such models can be successfully ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fractals
سال: 2015
ISSN: 0218-348X,1793-6543
DOI: 10.1142/s0218348x15500073